Combinatorial sums and finite differences

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Combinatorial sums and finite differences

We present a new approach to evaluating combinatorial sums by using finite differences. Let {ak}k=0 and {bk}k=0 be sequences with the property that ∆bk = ak for k ≥ 0. Let gn = ∑n k=0 ( n k ) ak, and let hn = ∑n k=0 ( n k ) bk. We derive expressions for gn in terms of hn and for hn in terms of gn. We then extend our approach to handle binomial sums of the form ∑n k=0 ( n k ) (−1)ak, ∑ k ( n 2k ...

متن کامل

Some combinatorial aspects of finite Hamiltonian groups

In this paper we provide explicit formulas for the number of elements/subgroups/cyclic subgroups of a given order and for the total number of subgroups/cyclic subgroups in a finite Hamiltonian group. The coverings with three proper subgroups and the principal series of such a group are also counted. Finally, we give a complete description of the lattice of characteristic subgroups of a finite H...

متن کامل

Left-inversion of combinatorial sums

The inversion of combinatorial sums is a fundamental problem in algebraic combinatorics. Some combinatorial sums, such as a n = P k d n;k b k , can not be inverted in terms of the orthogonality relation because the innnite, lower triangular array P = fd n;k g's diagonal elements are equal to zero (except d 0;0). Despite this, we can nd a left-inverse P such that P P = I and therefore are able t...

متن کامل

Combinatorial sums and implicit Riordan arrays

In this paper we present the theory of implicit Riordan arrays, that is, Riordan arrays which require the application of the Lagrange Inversion Formula to be dealt with. We show several examples in which our approach gives explicit results, both in finding closed expressions for sums and, especially, in solving classes of combinatorial sum inversions.

متن کامل

On Various Combinatorial Sums and Related Identities

In this talk we give a survey of results and methods on some combinatorial sums involving binomial coefficients and related to Bernoulli and Euler polynomials. We will also talk about certain sums of minima and maxima related to Dedekind sums. Some interesting identities associated with the various sums will also be introduced. 1. A curious identity and the sum ∑ k≡r (mod m) ( n k ) In 1988 Zhi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics

سال: 2007

ISSN: 0012-365X

DOI: 10.1016/j.disc.2007.03.052